Modeling Fixed-Priority Preemptive Multi-Task Systems in SpecC
نویسندگان
چکیده
Many real-world embedded systems employ a preemptive scheduling policy in order to satisfy their realtime requirements. However, most System-Level Design Languages (SLDLs) which were proposed up to now, such as SpecC, do not explicitly support modeling of preemptions. This paper proposes techniques for modeling xed-priority preemptive multi-task systems in the SpecC SLDL. The modeling techniques with SpecC enable a system designer to specify and simulate preemptive multi-task systems including both software and hardware at a high level of abstraction, without assuming any speci c real-time operating system.
منابع مشابه
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which th...
متن کاملOptimal Priority Assignments in P-FRP
Priority-based Functional Reactive Programming (P-FRP) has been recently introduced as a new functional programming formalism for real-time systems. P-FRP allows static priority assignment and guarantees real-time response by preempting lower priority tasks. Due to the state-less nature of functional programs, preempted tasks in P-FRP are aborted and restarted after the higher priority tasks ha...
متن کاملScheduling Fixed-Priority Tasks with Preemption Threshold An Attractive Technology?
While it is widely believed that preemptibility is a necessary requirement for developing real-time software, there are additional costs involved with preemptive scheduling, as compared to non-preemptive scheduling. Furthermore, in the context of fixed-priority scheduling, feasibility of a task set with nonpreemptive scheduling does not imply feasibility with preemptive scheduling (and vice-ver...
متن کاملMULTI-OBJECTIVE OPTIMIZATION WITH PREEMPTIVE PRIORITY SUBJECT TO FUZZY RELATION EQUATION CONSTRAINTS
This paper studies a new multi-objective fuzzy optimization prob- lem. The objective function of this study has dierent levels. Therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. Since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. We study this problem and determine some special structures related...
متن کاملAn Empirical Investigation of Eager and Lazy Preemption Approaches in Global Limited Preemptive Scheduling
Global limited preemptive real-time scheduling in multiprocessor systems using Fixed Preemption Points (FPP) brings in an additional challenge with respect to the choice of the task to be preempted in order to maximize schedulability. Two principal choices with respect to the preemption approach exist 1) the scheduler waits for the lowest priority job to become preemptible, 2) the scheduler pre...
متن کامل